Subgraph Matching on Multiplex Networks

An active area of research in computational science is the design algorithms for solving subgraph matching problem to find copies a given template graph larger world graph. Prior works have largely addressed single-channel networks using variety approaches. We present suite filtering methods isomorphisms multiplex (with different types edges between nodes and more than one edge within each channel type). aim understand entire solution space rather focusing on finding isomorphism. Results are shown several classes datasets: (a) Sudoku puzzles mapped isomorphism problem, (b) Erdös-Rényi multigraphs, (c) real-world datasets from Twitter transportation networks, (d) synthetic data created DARPA MAA program.